<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/graph_algorithms/basic_graph/graph_representation/graph_vertex/front_flow_vertex.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('front__flow__vertex_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">front_flow_vertex.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="front__flow__vertex_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef FRONTFLOWVERTEX</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define FRONTFLOWVERTEX</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&quot;<a class="code" href="flow__vertex_8h.html">flow_vertex.h</a>&quot;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespace_introduction_to_algorithm.html">IntroductionToAlgorithm</a></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;{</div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;    <span class="keyword">namespace </span>GraphAlgorithm</div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;    {</div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;</div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div>
<div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html">   37</a></span>&#160;        <span class="keyword">template</span>&lt;<span class="keyword">typename</span> NodeType&gt; <span class="keyword">struct </span><a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html">List</a></div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        {</div>
<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a78a07f79c1c8133b74f23ec794e0557e">   39</a></span>&#160;            std::shared_ptr&lt;NodeType&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a78a07f79c1c8133b74f23ec794e0557e">head</a>;</div>
<div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#ad321a5c55f1f58c6054b7925ea007f89">   40</a></span>&#160;            std::shared_ptr&lt;NodeType&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#ad321a5c55f1f58c6054b7925ea007f89">current</a>;</div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;</div>
<div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a286b76ddec66a739312a2f5cef3ae544">   48</a></span>&#160;            <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a286b76ddec66a739312a2f5cef3ae544">List</a>():head(std::shared_ptr&lt;NodeType&gt;()),current(std::shared_ptr&lt;NodeType&gt;()){}</div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;</div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;</div>
<div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a03267a13e44d42586d44460d04138cc1">   58</a></span>&#160;            <span class="keywordtype">void</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a03267a13e44d42586d44460d04138cc1">add</a>(std::shared_ptr&lt;NodeType&gt; element)</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;            {</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;                <span class="keywordflow">if</span>(!element)</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;                    <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;                <span class="keywordflow">if</span>(head) <span class="comment">//链表非空</span></div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;                {</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;                    element-&gt;next=<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a78a07f79c1c8133b74f23ec794e0557e">head</a>;</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;                    head=element;</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;                }<span class="keywordflow">else</span> <span class="comment">//链表为空</span></div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;                {</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;                    head=element;</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;                }</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;            }</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;</div>
<div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#abd886aeac60fbdfa0290cafd7d67b718">   81</a></span>&#160;            std::shared_ptr&lt;NodeType&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#abd886aeac60fbdfa0290cafd7d67b718">front_of</a>(std::shared_ptr&lt;NodeType&gt; element)<span class="keyword">const</span></div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;<span class="keyword">            </span>{</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;                <span class="keywordflow">if</span>(!element)</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;                    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;front_of error: element must not be null!&quot;</span>);</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;                std::shared_ptr&lt;NodeType&gt; pre;</div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;                std::shared_ptr&lt;NodeType&gt; cur=<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a78a07f79c1c8133b74f23ec794e0557e">head</a>;</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;                <span class="keywordflow">while</span>(cur)</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;                {</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;                    <span class="keywordflow">if</span>(element==cur)</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;                        <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;                    pre=cur;</div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;                    cur=cur-&gt;next;</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;                }</div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;                <span class="keywordflow">if</span>(!cur)</div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;                    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;front_of error: element not in the list!&quot;</span>);</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">return</span> pre;</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;            }</div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;</div>
<div class="line"><a name="l00106"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a7a75e61d7a61923e5b185e1b4781d29f">  106</a></span>&#160;            std::string <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a7a75e61d7a61923e5b185e1b4781d29f">to_string</a>()<span class="keyword"> const</span></div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;<span class="keyword">            </span>{</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;                std::ostringstream os;</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;                os&lt;&lt;<span class="stringliteral">&quot;list:\n&quot;</span>;</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;                <span class="keyword">auto</span> cur=<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a78a07f79c1c8133b74f23ec794e0557e">head</a>;</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;                <span class="keywordflow">while</span>(cur)</div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;                {</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;                    os&lt;&lt;cur-&gt;to_string()&lt;&lt;<span class="stringliteral">&quot;;\t&quot;</span>;</div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;                    cur=cur-&gt;next;</div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;                }</div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;                os&lt;&lt;<span class="stringliteral">&quot;\ncurrent:\t&quot;</span>;</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;                <span class="keywordflow">if</span>(current)</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;                    os&lt;&lt;current-&gt;to_string();</div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;                <span class="keywordflow">else</span> os&lt;&lt;<span class="stringliteral">&quot;nullptr&quot;</span>;</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;                <span class="keywordflow">return</span> os.str();</div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;            }</div>
<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;        };</div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;</div>
<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;</div>
<div class="line"><a name="l00133"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html">  133</a></span>&#160;        <span class="keyword">template</span>&lt;<span class="keyword">typename</span> ValueType&gt; <span class="keyword">struct </span><a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html">ListNode</a></div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;        {</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;</div>
<div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a28a10edc3e4414f2b3f41945bb886be4">  141</a></span>&#160;            <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a28a10edc3e4414f2b3f41945bb886be4">ListNode</a>():<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a77c644bba4a2996906d1d5b5be300b00">value</a>(std::weak_ptr&lt;ValueType&gt;()),<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a78e88960b96014607258bf721c2023d1">next</a>(std::shared_ptr&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html">ListNode</a>&gt;()){}</div>
<div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a77c644bba4a2996906d1d5b5be300b00">  142</a></span>&#160;            std::weak_ptr&lt;ValueType&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a77c644bba4a2996906d1d5b5be300b00">value</a>;</div>
<div class="line"><a name="l00143"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a78e88960b96014607258bf721c2023d1">  143</a></span>&#160;            std::shared_ptr&lt;ListNode&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a78e88960b96014607258bf721c2023d1">next</a>;</div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;</div>
<div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a09b7805e42547e2cf808e6be7b202be5">  150</a></span>&#160;            std::string <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a09b7805e42547e2cf808e6be7b202be5">to_string</a>()<span class="keyword"> const</span></div>
<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;<span class="keyword">            </span>{</div>
<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;                std::ostringstream os;</div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;                os&lt;&lt;<span class="stringliteral">&quot;list_node:&quot;</span>;</div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                <span class="keyword">auto</span> lock_v=value.lock();</div>
<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                <span class="keywordflow">if</span>(lock_v)</div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;                    os&lt;&lt;lock_v-&gt;to_string();</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;                <span class="keywordflow">else</span> os&lt;&lt;<span class="stringliteral">&quot;nullptr&quot;</span>;</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;                <span class="keywordflow">return</span> os.str();</div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;            }</div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;        };</div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;</div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;</div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;</div>
<div class="line"><a name="l00175"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html">  175</a></span>&#160;        <span class="keyword">template</span>&lt;<span class="keyword">typename</span> KType&gt; <span class="keyword">struct </span><a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html">FrontFlowVertex</a>:<span class="keyword">public</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_flow_vertex.html">FlowVertex</a>&lt;KType&gt;</div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;        {</div>
<div class="line"><a name="l00177"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#a76ed9e9d0c0da5c60c4a004eeda192ad">  177</a></span>&#160;            <span class="keyword">typedef</span> KType <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#a76ed9e9d0c0da5c60c4a004eeda192ad">KeyType</a>;    </div>
<div class="line"><a name="l00178"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#ab1973e8ed99c2e213532fabbee1a66b8">  178</a></span>&#160;            <span class="keyword">typedef</span> <span class="keywordtype">int</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#ab1973e8ed99c2e213532fabbee1a66b8">VIDType</a>;      </div>
<div class="line"><a name="l00180"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#ad66fead451e2af4756f0fd7a644e1319">  180</a></span>&#160;            <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html">List&lt;ListNode&lt;FrontFlowVertex&gt;</a>&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#ad66fead451e2af4756f0fd7a644e1319">N_List</a>; </div>
<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;            <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#a9890efaa1818c914f138ac063b679fe2">FrontFlowVertex</a>(){}</div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;</div>
<div class="line"><a name="l00188"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#af6c0dd18f309fdc4f6cd475a3f629f70">  188</a></span>&#160;            <span class="keyword">explicit</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#af6c0dd18f309fdc4f6cd475a3f629f70">FrontFlowVertex</a>(<span class="keyword">const</span> KeyType&amp;k):<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_flow_vertex.html">FlowVertex</a>&lt;KeyType&gt;(k){}</div>
<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;</div>
<div class="line"><a name="l00194"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#ae9af6850fbdfa4c8a192ea66778e6b59">  194</a></span>&#160;            <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#ae9af6850fbdfa4c8a192ea66778e6b59">FrontFlowVertex</a>(<span class="keyword">const</span> KeyType&amp;k,VIDType d):<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_flow_vertex.html">FlowVertex</a>&lt;KeyType&gt;(k,d){}</div>
<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;</div>
<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;</div>
<div class="line"><a name="l00202"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#a3edfb3a6f29475f338340291ad71eab9">  202</a></span>&#160;            <span class="keyword">virtual</span> std::string <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#a3edfb3a6f29475f338340291ad71eab9">to_string</a>()<span class="keyword"> const</span></div>
<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;<span class="keyword">            </span>{</div>
<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                std::ostringstream os;</div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;                os&lt;&lt;FlowVertex&lt;KType&gt;::to_string()&lt;&lt;<span class="stringliteral">&quot;\t N_List:&quot;</span>&lt;&lt;N_List.<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a7a75e61d7a61923e5b185e1b4781d29f">to_string</a>();</div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;                <span class="keywordflow">return</span> os.str();</div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;            }</div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;        };</div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;</div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;    }</div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;}</div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;<span class="preprocessor">#endif // FRONTFLOWVERTEX</span></div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;</div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex_html_ab1973e8ed99c2e213532fabbee1a66b8"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#ab1973e8ed99c2e213532fabbee1a66b8">IntroductionToAlgorithm::GraphAlgorithm::FrontFlowVertex::VIDType</a></div><div class="ttdeci">int VIDType</div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00178">front_flow_vertex.h:178</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html">IntroductionToAlgorithm::GraphAlgorithm::FrontFlowVertex</a></div><div class="ttdoc">FrontFlowVertex：relabel_to_front算法的图的结点的数据结构，算法导论26章26.4节 </div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00175">front_flow_vertex.h:175</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_html_a03267a13e44d42586d44460d04138cc1"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a03267a13e44d42586d44460d04138cc1">IntroductionToAlgorithm::GraphAlgorithm::List::add</a></div><div class="ttdeci">void add(std::shared_ptr&lt; NodeType &gt; element)</div><div class="ttdoc">add:添加元素 </div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00058">front_flow_vertex.h:58</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex_html_af6c0dd18f309fdc4f6cd475a3f629f70"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#af6c0dd18f309fdc4f6cd475a3f629f70">IntroductionToAlgorithm::GraphAlgorithm::FrontFlowVertex::FrontFlowVertex</a></div><div class="ttdeci">FrontFlowVertex(const KeyType &amp;k)</div><div class="ttdoc">显式构造函数，指定key </div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00188">front_flow_vertex.h:188</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node_html_a09b7805e42547e2cf808e6be7b202be5"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a09b7805e42547e2cf808e6be7b202be5">IntroductionToAlgorithm::GraphAlgorithm::ListNode::to_string</a></div><div class="ttdeci">std::string to_string() const </div><div class="ttdoc">to_string：返回结点的字符串描述 </div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00150">front_flow_vertex.h:150</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html">IntroductionToAlgorithm::GraphAlgorithm::List</a></div><div class="ttdoc">List：链表数据结构 </div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00037">front_flow_vertex.h:37</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex_html_ae9af6850fbdfa4c8a192ea66778e6b59"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#ae9af6850fbdfa4c8a192ea66778e6b59">IntroductionToAlgorithm::GraphAlgorithm::FrontFlowVertex::FrontFlowVertex</a></div><div class="ttdeci">FrontFlowVertex(const KeyType &amp;k, VIDType d)</div><div class="ttdoc">显式构造函数，指定key和编号 </div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00194">front_flow_vertex.h:194</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node_html_a78e88960b96014607258bf721c2023d1"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a78e88960b96014607258bf721c2023d1">IntroductionToAlgorithm::GraphAlgorithm::ListNode::next</a></div><div class="ttdeci">std::shared_ptr&lt; ListNode &gt; next</div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00143">front_flow_vertex.h:143</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex_html_a3edfb3a6f29475f338340291ad71eab9"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#a3edfb3a6f29475f338340291ad71eab9">IntroductionToAlgorithm::GraphAlgorithm::FrontFlowVertex::to_string</a></div><div class="ttdeci">virtual std::string to_string() const </div><div class="ttdoc">to_string：返回顶点的字符串描述 </div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00202">front_flow_vertex.h:202</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_html_a7a75e61d7a61923e5b185e1b4781d29f"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a7a75e61d7a61923e5b185e1b4781d29f">IntroductionToAlgorithm::GraphAlgorithm::List::to_string</a></div><div class="ttdeci">std::string to_string() const </div><div class="ttdoc">to_string：返回链表的字符串描述 </div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00106">front_flow_vertex.h:106</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_html_abd886aeac60fbdfa0290cafd7d67b718"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#abd886aeac60fbdfa0290cafd7d67b718">IntroductionToAlgorithm::GraphAlgorithm::List::front_of</a></div><div class="ttdeci">std::shared_ptr&lt; NodeType &gt; front_of(std::shared_ptr&lt; NodeType &gt; element) const </div><div class="ttdoc">front_of:链表指定元素前面的元素 </div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00081">front_flow_vertex.h:81</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_html_a78a07f79c1c8133b74f23ec794e0557e"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a78a07f79c1c8133b74f23ec794e0557e">IntroductionToAlgorithm::GraphAlgorithm::List::head</a></div><div class="ttdeci">std::shared_ptr&lt; NodeType &gt; head</div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00039">front_flow_vertex.h:39</a></div></div>
<div class="ttc" id="flow__vertex_8h_html"><div class="ttname"><a href="flow__vertex_8h.html">flow_vertex.h</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex_html_a9890efaa1818c914f138ac063b679fe2"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#a9890efaa1818c914f138ac063b679fe2">IntroductionToAlgorithm::GraphAlgorithm::FrontFlowVertex::FrontFlowVertex</a></div><div class="ttdeci">FrontFlowVertex()</div><div class="ttdoc">默认构造函数 </div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00183">front_flow_vertex.h:183</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node_html_a28a10edc3e4414f2b3f41945bb886be4"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a28a10edc3e4414f2b3f41945bb886be4">IntroductionToAlgorithm::GraphAlgorithm::ListNode::ListNode</a></div><div class="ttdeci">ListNode()</div><div class="ttdoc">ListNode默认构造函数 </div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00141">front_flow_vertex.h:141</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex_html_a76ed9e9d0c0da5c60c4a004eeda192ad"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#a76ed9e9d0c0da5c60c4a004eeda192ad">IntroductionToAlgorithm::GraphAlgorithm::FrontFlowVertex::KeyType</a></div><div class="ttdeci">KType KeyType</div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00177">front_flow_vertex.h:177</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html">IntroductionToAlgorithm::GraphAlgorithm::ListNode</a></div><div class="ttdoc">ListNode：链表结点的数据结构 </div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00133">front_flow_vertex.h:133</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex_html_ad66fead451e2af4756f0fd7a644e1319"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex.html#ad66fead451e2af4756f0fd7a644e1319">IntroductionToAlgorithm::GraphAlgorithm::FrontFlowVertex::N_List</a></div><div class="ttdeci">List&lt; ListNode&lt; FrontFlowVertex &gt; &gt; N_List</div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00180">front_flow_vertex.h:180</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_flow_vertex_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_flow_vertex.html">IntroductionToAlgorithm::GraphAlgorithm::FlowVertex</a></div><div class="ttdoc">FlowVertex：推送-重贴标签算法图的顶点，算法导论26章26.4节 </div><div class="ttdef"><b>Definition:</b> <a href="flow__vertex_8h_source.html#l00034">flow_vertex.h:34</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node_html_a77c644bba4a2996906d1d5b5be300b00"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node.html#a77c644bba4a2996906d1d5b5be300b00">IntroductionToAlgorithm::GraphAlgorithm::ListNode::value</a></div><div class="ttdeci">std::weak_ptr&lt; ValueType &gt; value</div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00142">front_flow_vertex.h:142</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_html"><div class="ttname"><a href="namespace_introduction_to_algorithm.html">IntroductionToAlgorithm</a></div><div class="ttdoc">Namespace of IntrodunctionToAlgorithm. </div><div class="ttdef"><b>Definition:</b> <a href="longest__common__subsequence_8h_source.html#l00024">longest_common_subsequence.h:24</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_html_ad321a5c55f1f58c6054b7925ea007f89"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#ad321a5c55f1f58c6054b7925ea007f89">IntroductionToAlgorithm::GraphAlgorithm::List::current</a></div><div class="ttdeci">std::shared_ptr&lt; NodeType &gt; current</div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00040">front_flow_vertex.h:40</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_html_a286b76ddec66a739312a2f5cef3ae544"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list.html#a286b76ddec66a739312a2f5cef3ae544">IntroductionToAlgorithm::GraphAlgorithm::List::List</a></div><div class="ttdeci">List()</div><div class="ttdoc">List默认构造函数 </div><div class="ttdef"><b>Definition:</b> <a href="front__flow__vertex_8h_source.html#l00048">front_flow_vertex.h:48</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_aa0a5ddea82682e3e6fbdbaa3337ee0e.html">graph_algorithms</a></li><li class="navelem"><a class="el" href="dir_7ed7dee3af3b488a5e053ec9bcb71f0e.html">basic_graph</a></li><li class="navelem"><a class="el" href="dir_d12496f1fc7378ee9aea361c57814de0.html">graph_representation</a></li><li class="navelem"><a class="el" href="dir_fe18ed58836c2c8442913a14822c363c.html">graph_vertex</a></li><li class="navelem"><a class="el" href="front__flow__vertex_8h.html">front_flow_vertex.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
